Privacy-Enhanced Robust Image Hashing with Bloom Filters
نویسندگان
چکیده
منابع مشابه
Privacy-Enhanced Searches Using Encrypted Bloom Filters
It is often necessary for two or more or more parties that do not fully trust each other to selectively share data. We propose a search scheme based on Bloom filters and Pohlig-Hellman encryption. A semi-trusted third party can transform one party’s search queries to a form suitable for querying the other party’s database, in such a way that neither the third party nor the database owner can se...
متن کاملBloom Filters and Locality - Sensitive Hashing
This section follows 5.5.3 in Mitzenmacher/Upfal. Bloom Filters are a compact data structure for approximate membership queries. The data structure uses only linear space. It makes mistakes in the sense that non-members may be declared members with small probability. Let S = {e1, . . . , em} be the elements to be stored; S is a subset of some universe U . We use a boolean array T of length n. W...
متن کاملPrivacy-preserving record linkage using Bloom filters
BACKGROUND Combining multiple databases with disjunctive or additional information on the same person is occurring increasingly throughout research. If unique identification numbers for these individuals are not available, probabilistic record linkage is used for the identification of matching record pairs. In many applications, identifiers have to be encrypted due to privacy concerns. METHOD...
متن کاملRobust Image Hashing
The proliferation of digital images creates problems for managing large image databases, indexing individual images, and protecting intellectual property. This paper introduces a novel image indexing technique that may be called an image hash function. The algorithm uses randomized signal processing strategies for a non-reversible compression of images into random binary strings, and is shown t...
متن کامل"Better Than Nothing" Privacy with Bloom Filters: To What Extent?
Bloom filters are probabilistic data structures which permit to conveniently represent set membership. Their performance/memory efficiency makes them appealing in a huge variety of scenarios. Their probabilistic operation, along with the implicit data representation, yields some ambiguity on the actual data stored, which, in scenarios where cryptographic protection is unviable or unpractical, m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cyber Security and Mobility
سال: 2021
ISSN: 2245-4578,2245-1439
DOI: 10.13052/jcsm2245-1439.1014